Simulation of Analog Solution of Boolean Satisfiability

Towards a Physical Oracle for the Partition Problem using Analogue Computing

Despite remarkable achievements in its practical tractability, the notorious class of Np-complete problems has been escaping all attempts to find a worst-case polynomial time-bound solution algorithms for any of them. The vast majority of work relies on Turing machines or equivalent models, all of which relate to digital computing. This raises the question of whether a computer that is (partly)...

Synthesis and Verification of Digital Circuits using Functional Simulation and Boolean Satisfiability

Order-to-chaos transition in the hardness of random Boolean satisfiability problems

Transient chaos is a ubiquitous phenomenon characterizing the dynamics of phase-space trajectories evolving towards a steady-state attractor in physical systems as diverse as fluids, chemical reactions, and condensed matter systems. Here we show that transient chaos also appears in the dynamics of certain efficient algorithms searching for solutions of constraint satisfaction problems that incl...

The Next Generation of Static Analysis Boolean Satisfiability and Path Simulation—A Perfect Match

Reliability assessment of power distribution systems using disjoint path-set algorithm

Finding the reliability expression of different substation configurations can help design a distribution system with the best overall reliability. This paper presents a computerized a nd implemented algorithm, based on Disjoint Sum of Product (DSOP) algorithm. The algorithm was synthesized and applied for the first time to the determination of reliability expression of a substation to determine...